Solutions to the Problem of K-SAT / K-COL Phase Transition Location

نویسنده

  • Changqing Liu
چکیده

As general theories, currently there are concentration inequalities (of random walk) only for the cases of independence and martingale differences. In this paper, the concentration inequalities are extended to more general situations. In terms of the theory presented in the paper, the condition of independence is ∂y ∂t = constant and martingale difference’s is ∂y ∂t = 0. This paper relaxes these conditions to ∂y ∂ui∂t ≤ L; i.e. ∂y ∂t can vary. Further, the concentration inequalities are extended to branching random walk, the applications of which solve some long standing open problems, including the well known problems of K-SAT and K-COL phase transition locations, among others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid DEA-based K-means and invasive weed optimization for facility location problem

In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...

متن کامل

New Upper Bounds for the SAT / UNSAT Threshold for Shapes

Phase transitions not only occur in physics but also in many problems in computer science. Among the problems from computer science, there are many NP-complete ones. An especially important problem is the satisfiability problem, SAT, for Boolean formulas. When phase transitions of SAT problems are studied, the corresponding formulas are usually restricted to conjunctive normal form, i.e., the f...

متن کامل

Relaxation in graph coloring and satisfiability problems

Using T50 Monte Carlo simulation, we study the relaxation of graph coloring ~K-COL! and satisfiability ~K-SAT!, two hard problems that have recently been shown to possess a phase transition in solvability as a parameter is varied. A change from exponentially fast to power law relaxation, and a transition to freezing behavior are found. These changes take place for smaller values of the paramete...

متن کامل

The K-sat problem in a simple limit

The statistical mechanics of the random K-satisfiability (K-SAT) problem has been the object of many studies in the last years [1][2][3]. The K-SAT was the first problem to be shown to be Nondeterministic Polynomial (NP) complete [4] and the importance of such a model is that it provides a prototype for all the NP complete problems in complexity theory of computer science as well as in statisti...

متن کامل

The SAT Phase Transition

Phase transition is an important feature of SAT problem. In this paper, for random k SAT model, we prove that as r (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition when r reaches a threshold point ( cr r r = ). This phenomenon shows that the satisfying truth assignments suddenly shift from being relatively di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1601.04794  شماره 

صفحات  -

تاریخ انتشار 2016